Combining EDF and FP in Distributed Real-Time Systems: Schedulability Analysis and Optimization
نویسندگان
چکیده
The increasing acceptance of the Earliest Deadline First (EDF) scheduling algorithm in industrial environments, together with the continued usage of Fixed Priority (FP) scheduling is leading to heterogeneous systems with different scheduling policies in the same distributed system. Schedulability analysis techniques usually consider the entire system as a whole (holistic approach), with only one preestablished scheduling policy in all the resources. In this work, composition mechanisms will be proposed that enable us to combine different FP and EDF response-time analysis techniques for checking the schedulability of heterogeneous systems. Additionally, priority and scheduling deadline assignment techniques will be combined into the a new algorithm called HOSPA (Heuristic Optimized Scheduling Parameters Assignment), for optimizing the assignment of priorities and scheduling deadlines to tasks and messages in heterogeneous distributed hard real-time systems.
منابع مشابه
Limited carry-in technique for real-time multi-core scheduling
Schedulability analysis has been widely studied to provide offline timing guarantees for a set of real-time tasks. The so-called limited carry-in technique, which can be orthogonally incorporated into many different multi-core schedulability analysis methods, was originally introduced for Earliest Deadline First (EDF) scheduling to derive a tighter bound on the amount of interference of carry-i...
متن کاملOptimized Deadline Assignment and Schedulability Analysis for Distributed Real-Time Systems with Local EDF Scheduling
The assignment of scheduling parameters under the Earliest Deadline First (EDF) scheduling policy is trivial in single processor systems because deadlines are used directly. However, it is still difficult to find a feasible deadline assignment for EDF distributed systems when the utilization levels of the CPUs and communication networks are pushed near to their limits. Most distributed applicat...
متن کاملA Comparison between Fixed Priority and EDF Scheduling accounting for Cache Related Pre-emption Delays
In multitasking real-time systems, the choice of scheduling algorithm is an important factor to ensure that response time requirements are met while maximising limited system resources. Two popular scheduling algorithms include fixed priority (FP) and earliest deadline first (EDF). While they have been studied in great detail before, they have not been compared when taking into account cache re...
متن کاملResponse time analysis of EDF distributed real-time systems
1 —Offset-based response time analysis of tasks scheduled with fixed priorities has demonstrated to be a powerful tool to analyze many task models with different kinds of timing constraints , like regular periodic tasks, suspending tasks, distributed systems, tasks with varying priorities, multiframe models, etc. Offset based analysis techniques are capable of performing a global schedulability...
متن کاملCombining EDF and FP Scheduling: Analysis and Implementation in Ada 2005
Earliest Deadline First (EDF) and Fixed Priority (FP) scheduling represent the two main dispatching policies within the research domain of real-time systems engineering. Both dispatching policies are now supported by Ada. In this paper the two approaches are combined to maximize the advantages of both schemes. From EDF comes efficiency, from FP predictability. A system model is presented in whi...
متن کامل